Index-based update policy for minimizing information mismatch with Markovian sources
نویسندگان
چکیده
منابع مشابه
Opposition-Based Q(λ) with Non-Markovian Update
The OQ(λ) algorithm benefits from an extension of eligibility traces introduced as opposition trace. This new technique is a combination of the idea of opposition and eligibility traces to deal with large state space problems in reinforcement learning applications. In our previous works the comparison of the results of OQ(λ) and conventional Watkins’ Q(λ) reflected a remarkable increase in perf...
متن کاملDynamic Policy Update for Ciphertext-Policy Attribute-Based Encryption
Ciphertext-policy attribute-based encryption (CP-ABE) is regarded as a promising cryptographic tool for encrypted access control in public cloud storage systems. However, a problem for CP-ABE schemes is that there is no way to change access policy on ciphertext once it is generated. This shortcoming makes us cannot conveniently use CP-ABE as traditional 1-to-1 public key encryption when the acc...
متن کاملMinimizing Loss of Information at Competitive PLIP Algorithms for Image Segmentation with Noisy Back Ground
In this paper, two training systems for selecting PLIP parameters have been demonstrated. The first compares the MSE of a high precision result to that of a lower precision approximation in order to minimize loss of information. The second uses EMEE scores to maximize visual appeal and further reduce information loss. It was shown that, in the general case of basic addition, subtraction, or mul...
متن کاملVersatile Markovian Models for Networks with Asymmetric TCP Sources
In this paper we use Stochastic Petri Nets (SPNs) to study the interaction of multiple TCP sources that share one or two buffers, thereby considerably extending earlier work. We first consider two sources sharing a buffer and investigate the consequences of two popular assumptions for the loss process in terms of fairness and link utilization. The results obtained by our model are in agreement ...
متن کاملCoding for Computing Irreducible Markovian Functions of Sources with Memory
One open problem in source coding is to characterize the limits of representing losslessly a non-identity discrete function of the data encoded independently by the encoders of several correlated sources with memory. This paper investigates this problem under Markovian conditions, namely either the sources or the functions considered are Markovian. We propose using linear mappings over finite r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Communications and Networks
سال: 2021
ISSN: ['1976-5541', '1229-2370']
DOI: https://doi.org/10.23919/jcn.2021.000027